Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes
نویسندگان
چکیده
Expander graphs are highly connected sparse nite graphs. The property of being an expander seems signi cant in many of these mathematical, computational and physical contexts. For practical applications it is very important to construct expander and Ramanujan graphs with given regularity and order. In general, constructions of the best expander graphs with a given regularity and order is no easy task. In this paper we present algorithms for generation of Ramanujan graphs and other expanders. We describe properties of obtained graphs in comparison to previously known results. We present a method to obtain a new examples of irregular LDPC codes based on described graphs and we brie y describe properties of this codes. (Received: 07.07.2015; Revised: 29.09.2015; Published: 10.11.2015)
منابع مشابه
Some new Algebraic constructions of Codes from Graphs which are good Expanders∗
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders. LDPC codes are designed based on the zigzag product graph of two component Cayley graphs. The results for specific cases simulated reveal that the resulting LDPC codes compare well with other random L...
متن کاملRecent Developments in Low-Density Parity-Check Codes
In this paper we prove two results related to low-density parity-check (LDPC) codes. The first is to show that the generating function attached to the pseudo-codewords of an LDPC code is a rational function, answering a question raised in [6]. The combinatorial information of its numerator and denominator is also discussed. The second concerns an infinite family of q-regular bipartite graphs wi...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015